The First Positive Rank and Crank Moments for Overpartitions

نویسندگان

  • GEORGE ANDREWS
  • SONG HENG CHAN
  • ROBERT OSBURN
چکیده

In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. These moments satisfy a strict inequality. We prove that a strict inequality also holds for the first rank and crank moments of overpartitions and consider a new combinatorial interpretation in this setting.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank and Crank Moments for Overpartitions

We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in terms of quasimodular forms. We then use this fact to prove exact relations involving the moments as well as congruence properties modulo 3, 5, and 7 for som...

متن کامل

ON THE NUMBER OF EVEN AND ODD STRINGS ALONG THE OVERPARTITIONS OF n

A partition of a non-negative integer n is a non-increasing sequence of positive integers whose sum is n. For example, The 5 partitions of 4 are 4, 3 + 1, 2 + 2, 2 + 1 + 1, and 1 + 1 + 1 + 1. To explain Ramanujan’s famous three partition congruences, the partition statistics, the rank (resp. the crank) were introduced by Dyson [8] (resp. Andrews and Garvan [3]). Atkin and Garvan [5] initiated t...

متن کامل

Asymptotic Inequalities for Positive Crank and Rank Moments

Andrews, Chan, and Kim recently introduced a modified definition of crank and rank moments for integer partitions that allows the study of both even and odd moments. In this paper, we prove the asymptotic behavior of these moments in all cases. Our main result states that the two families of moment functions are asymptotically equal, but the crank moments are also asymptotically larger than the...

متن کامل

Inequalities Between Ranks and Cranks

Higher moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves the first several cases of (and strengthens) a conjecture due to Garvan, which states that the moments of the crank function are always larger than the moments of the crank f...

متن کامل

Asymptotics for Rank and Crank Moments

Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to two of the authors that re ned a conjecture of Garvan. Garvan's original conjecture states that the moments of the crank function are always larger than the mome...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013